Generalized Orthogonal Discrete W Transform and Its Fast Algorithm
نویسندگان
چکیده
منابع مشابه
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
Abstract: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comparison of the computational complexity with the familiar row-column algorithm shows that the proposed approach reduces significantly the number of arithmetic operations. Moreover, the proposed method has very ...
متن کاملAn Orthogonal Discrete Auditory Transform
An orthogonal discrete auditory transform (ODAT) from sound signal to spectrum is constructed by combining the auditory spreading matrix of Schroeder et al and the time one map of a discrete nonlocal Schrödinger equation. Thanks to the dispersive smoothing property of the Schrödinger evolution, ODAT spectrum is smoother than that of the discrete Fourier transform (DFT) consistent with human aud...
متن کاملFast generalized Hough transform
A fast algorithm for the generalized Hough transform (GHT) based on the use of a hierarchical processing scheme and the inverse generalized Hough operation is proposed. By reducing the size of the image portion which need be processed in the proposed fast GHT, not only the computation time but also the number of processing elements for parallel processing can be reduced. The way to apply the pr...
متن کاملA refined fast 2-D discrete cosine transform algorithm
In this paper, a fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation. As a result, only the computation of N Npoint l-D DCT’s and some postadditions are required for the computation of an (?JxN)-point 2-D DCT. Furthermore, as compared with [7], the derivation of the refined algorithm is more succinct, and the associated po...
متن کاملA fast algorithm for multiresolution discrete Fourier transform
The paper presents a fast algorithm for the calculation of a multiresolution discrete Fourier transform. The presented approach is based on the realization of the Fast Fourier Transform for each frequency resolution level. This algorithm allows reducing the number of complex multiplications and additions compared to the method consisting in the multiplication between the input signal expressed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2021
ISSN: 1607-887X,1026-0226
DOI: 10.1155/2021/2529754